Lurking in social networks: topology-based analysis and ranking methods
نویسندگان
چکیده
منابع مشابه
Data Analysis Methods in Social Networks
Background and Aim. The promising outlook of easy communication incurring minimum cost has caused social networks to face increasing number of active members each day. These members develop and expand international communication through information sharing including personal information. Thus, big data analysis of social networks provides companies, organizations and governments with ample and ...
متن کاملModeling Evolutionary Dynamics of Lurking in Social Networks
Lurking is a complex user-behavioral phenomenon that occurs in all large-scale online communities and social networks. It generally refers to the behavior characterizing users that benefit from the information produced by others in the community without actively contributing back to the production of social content. The amount and evolution of lurkers may strongly affect an online social enviro...
متن کاملRanking Methods for Networks
Glossary Ranking: sort objects according to some order. Query-dependent ranking: objects are assigned with different ranks according to different queries. Proximity ranking: objects are ranked according to proximity or similarity to other objects. Homogeneous information network: networks that contain one type of objects and one type of relationships. Heterogeneous information network: networks...
متن کاملEndorsement Deduction and Ranking in Social Networks
Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. In this way, for each skill we get a directed graph where the nodes correspond to users’ profiles and the arcs represent endorsement relations. From the number and quality of the endorsements received, an authority score can be assigned to each profile. In this paper we propose an authority sco...
متن کاملCausality Based Propagation History Ranking in Social Networks
In social network sites (SNS), propagation histories which record the information diffusion process can be used to explain to users what happened in their networks. However, these histories easily grow in size and complexity, limiting their intuitive understanding by users. To reduce this information overload, in this paper, we present the problem of propagation history ranking. The goal is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Network Analysis and Mining
سال: 2014
ISSN: 1869-5450,1869-5469
DOI: 10.1007/s13278-014-0230-4